An Efficient Blind Signature Scheme Based on the Elliptic Curve Discrete Logarithm Problem
نویسندگان
چکیده
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme is quite commendable in comparison with the previous work in terms of security and time complexity. c © 2009 ISC. All rights reserved.
منابع مشابه
An efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملA Stamped Blind Signature Scheme based on Elliptic Curve Discrete Logarithm Problem
Here we present a stamped blind digital signature scheme which is based on elliptic curve discrete logarithm problem and collision-resistant cryptographic hash functions.
متن کاملNew Provably Secure Blind Signature Scheme with Weil Pairing
-------------------------------------------------------------------ABSTRACT-----------------------------------------------------Blind signature scheme provide the feature that a user is able to get a signature without giving the actual message to the signer. Many Blind signature schemes have been proposed in which security are based on intractability of factoring or DLP (Discrete Logarithm Prob...
متن کامل